GRASP for set packing problems
نویسندگان
چکیده
The principles of the Greedy Randomized Adaptative Search Procedure (GRASP) metaheuristic are instantiated for the set packing problem. We investigated several construction phases, and evaluated improvements based on advanced strategies. These improvements include a self-tuning procedure (using reactive GRASP), an intensification procedure (using path relinking) and a procedure involving the diversification of the selection (using a learning process). Two sets of various numerical instances were used to perform the computational experiments. The first set contains randomly generated instances, while the second includes instances relating to real problems in railway planning. No metaheuristic has previously been applied to this combinatorial problem. Consequently, we have discussed GRASP s performances both in relation to lower/upper bounds and to the results obtained with Cplex when such results are available. Our analysis, based on the average performances observed, shows the impact of the suggested strategies, and indicates the configuration that produces the best results. 2003 Elsevier B.V. All rights reserved.
منابع مشابه
A Novel GRASP Algorithm for Solving the Bin Packing Problem
The Bin Packing Problem (BPP) is one of the most known combinatorial optimization problems. This problem consists in packing a set of items into a minimum number of bins. There are several variants of this problem; the most basic problem is the onedimensional bin packing problem (1-BPP). In this paper, we present a new approach based on the GRASP procedure to deal with the1-BPP problem. The fir...
متن کاملMetaheuristics International Conference ? ? - 1 GRASP heuristic for the strip packing problem ∗
The rectangular Strip Packing Problem (SPP) consists of packing a given set of rectangles in a rectangular strip with fixed width w and variable height minimizing the height of the packing. In this work we propose a ”Greedy Randomized and Adaptive Constructive” heuristic, a GRASP metaheuristic without the post-processing phase, for the SPP in the version where the rectangles can be freely rotat...
متن کاملReactive GRASP for the strip-packing problem
This paper presents a greedy randomized adaptive search procedure (GRASP) for the strip packing problem, which is the problem of placing a set of rectangular pieces into a strip of a given width and infinite length so as to minimize the required length. We investigate several strategies for the constructive and improvement phases and several choices for critical search parameters. We perform ex...
متن کاملGRASP-VNS hybrid for the Strip Packing Problem
In this work we consider an hybrid metaheuristic approach to solve the Strip Packing Problem. In the hybrid algorithm, we use an Variable Neighbourhood Search (VNS) to improve the quality of part of the solution obtained with a Greedy Randomized Adaptive Search Procedure (GRASP). Then, the results achieved with the hybrid method are compared with those existing in the literature. From these res...
متن کاملAbstract: Packing rectangular shapes into a rectangular space is one of the most important discussions on Cutting & Packing problems (C;P) such as: cutting problem, bin-packing problem and distributor's pallet loading problem, etc. Assume a set of rectangular pieces with specific lengths, widths and utility values. Also assume a rectangular packing space with specific width and length. The obj...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- European Journal of Operational Research
دوره 153 شماره
صفحات -
تاریخ انتشار 2004